Deformed Bosons: Combinatorics of Normal Ordering

نویسندگان

  • P. Blasiak
  • A. Horzela
چکیده

[A,N ] = A, [A, N ] = −A†, [A,A] = [N + 1]− [N ]. (1) In the above A and A are annihilation and creation operators, respectively, while the number operator N counts particles. It is defined in the Fock basis as N |n〉 = n|n〉 and commutes with AA. Because of that in any representation of (1) N can be written in the form AA = [N ], where [N ] denotes an arbitrary function of N , usually called the ”box” function. For general considerations we do not assume any realization of the number operator N and we treat it as an independent element of the algebra. Moreover, we do not assume any particular form of the ”box” function [N ]. Special cases, like so(3) or so(2, 1) algebras, will provide examples that show how such a general approach simplifies if an algebra and its realization are chosen. In this note we give the solution to the problem of the normal ordering of a monomial (AA) in deformed annihilation and creation operators. A classical result due to J. Katriel [2] is that for canonical bosons a and a, i.e., for the Heisenberg-Weyl algebra, we have

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal ordering for deformed boson operators and operator-valued deformed Stirling numbers

The normal ordering formulae for powers of the boson number operator n̂ are extended to deformed bosons. It is found that for the “M-type” deformed bosons, which satisfy aa− qaa = 1, the extension involves a set of deformed Stirling numbers which replace the Stirling numbers occurring in the conventional case. On the other hand, the deformed Stirling numbers which have to be introduced in the ca...

متن کامل

Combinatorial Physics, Normal Order and Model Feynman Graphs

Abstract. The general normal ordering problem for boson strings is a combinatorial problem. In this talk we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. Finally we show that a graphical represen...

متن کامل

The topological ordering of covering nodes

The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...

متن کامل

Combinatorial coherent states via normal ordering of bosons

Abstract. We construct and analyze a family of coherent states built on sequences of integers originating from the solution of the boson normal ordering problem. These sequences generalize the conventional combinatorial Bell numbers and are shown to be moments of positive functions. Consequently, the resulting coherent states automatically satisfy the resolution of unity condition. In addition ...

متن کامل

ON qp-DEFORMATIONS IN STATISTICAL MECHANICS OF BOSONS IN D DIMENSIONS

The Bose distribution for a gas of nonrelativistic free bosons is derived in the framework of qp-deformed second quantization. Some thermodynamical functions for such a system in D dimensions are derived. Bose-Einstein condensation is discussed in terms of the parameters q and p as well as a parameter ν ′ 0 which characterizes the representation space of the oscillator algebra. The Bose distrib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004